2 00 5 the True Prosoluble Completion of a Group Examples and Open Problems
نویسنده
چکیده
The true prosoluble completion PS(Γ) of a group Γ is the inverse limit of the projective system of soluble quotients of Γ. Our purpose is to describe examples and to point out some natural open problems. We answer the analogue of a question of Grothendieck for profinite completions by providing examples of pairs of non–isomorphic residually soluble groups with isomorphic true prosoluble completions. We also provide a new class of finitely generated examples which answer the original Grothendieck’s problem.
منابع مشابه
M ay 2 00 6 THE TRUE PROSOLUBLE COMPLETION OF A GROUP EXAMPLES AND OPEN PROBLEMS
The true prosoluble completion PS(Γ) of a group Γ is the inverse limit of the projective system of soluble quotients of Γ. Our purpose is to describe examples and to point out some natural open problems. We discuss a question of Grothendieck for profinite completions and its analogue for true prosoluble and true pronilpotent completions.
متن کاملThe True Prosoluble Completion of A
The true prosoluble completion PS(Γ) of a group Γ is the inverse limit of the projective system of soluble quotients of Γ. Our purpose is to describe examples and to point out some natural open problems. We answer the analogue of a question of Grothendieck for profinite completions by providing examples of pairs of non–isomorphic residually soluble groups with isomorphic true prosoluble complet...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کامل